ERTS-1 data user investigation of the use of ERTS imagery in reservoir management and operation

There are no author-identified significant results in this report

Data collection system: Earth Resources Technology Satellite-1

Subjects covered at the meeting concerned results on the overall data collection system including sensors, interface hardware, power supplies, environmental enclosures, data transmission, processing and distribution, maintenance and integration in resources management systems

Spin 1 inversion: a Majorana tensor force for deuteron alpha scattering

We demonstrate, for the first time, successful S-matrix to potential inversion for spin one projectiles with non-diagonal $S^j_{ll'}$ yielding a $T_{\rm R}$ interaction. The method is a generalization of the iterative-perturbative, IP, method. We present a test case indicating the degree of uniqueness of the potential. The method is adapted, using established procedures, into direct observable to potential inversion, fitting $\sigma$, ${\rm i}T_{11}$, $T_{20}$, $T_{21}$ and $T_{22}$ for d + alpha scattering over a range of energies near 10 MeV. The $T_{\rm R}$ interaction which we find is very different from that proposed elsewhere, both real and imaginary parts being very different for odd and even parity channels.Comment: 7 pages Revtex, 4 ps figure

Density waves and supersolidity in rapidly rotating atomic Fermi gases

We study theoretically the low-temperature phases of a two-component atomic Fermi gas with attractive s-wave interactions under conditions of rapid rotation. We find that, in the extreme quantum limit, when all particles occupy the lowest Landau level, the normal state is unstable to the formation of "charge" density wave (CDW) order. At lower rotation rates, when many Landau levels are occupied, we show that the low-temperature phases can be supersolids, involving both CDW and superconducting order.Comment: 4 pages, 1 figure, uses feynmp.st

2000-times repeated imaging of strontium atoms in clock-magic tweezer arrays

We demonstrate single-atom resolved imaging with a survival probability of $0.99932(8)$ and a fidelity of $0.99991(1)$, enabling us to perform repeated high-fidelity imaging of single atoms in tweezers for thousands of times. We further observe lifetimes under laser cooling of more than seven minutes, an order of magnitude longer than in previous tweezer studies. Experiments are performed with strontium atoms in $813.4~\text{nm}$ tweezer arrays, which is at a magic wavelength for the clock transition. Tuning to this wavelength is enabled by off-magic Sisyphus cooling on the intercombination line, which lets us choose the tweezer wavelength almost arbitrarily. We find that a single not retro-reflected cooling beam in the radial direction is sufficient for mitigating recoil heating during imaging. Moreover, this cooling technique yields temperatures below $5~\mu$K, as measured by release and recapture. Finally, we demonstrate clock-state resolved detection with average survival probability of $0.996(1)$ and average state detection fidelity of $0.981(1)$. Our work paves the way for atom-by-atom assembly of large defect-free arrays of alkaline-earth atoms, in which repeated interrogation of the clock transition is an imminent possibility.Comment: 6 pages, 5 figures, 1 vide

Optical sum rules that relate to the potential energy of strongly correlated systems

A class of sum rules for inelastic light scattering is developed. We show that the first moment of the non-resonant response provides information about the potential energy in strongly correlated systems. The polarization dependence of the sum rules provide information about the electronic excitations in different regions of the Brillouin zone. We determine the sum rule for the Falicov-Kimball model, which possesses a metal-insulator transition, and compare our results to the light scattering experiments in SmB_6.Comment: (5 pages, 3 figures, typeset in ReVTeX

The Power of Two Choices in Distributed Voting

Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires $\Theta(n)$ expected steps to complete, even if initially there are only two distinct opinions. In this paper we consider a related process which we call two-sample voting: every vertex chooses two random neighbours in each step. If the opinions of these neighbours coincide, then the vertex revises its opinion according to the chosen sample. Otherwise, it keeps its own opinion. We consider the performance of this process in the case where two different opinions reside on vertices of some (arbitrary) sets $A$ and $B$, respectively. Here, $|A| + |B| = n$ is the number of vertices of the graph. We show that there is a constant $K$ such that if the initial imbalance between the two opinions is ?$\nu_0 = (|A| - |B|)/n \geq K \sqrt{(1/d) + (d/n)}$, then with high probability two sample voting completes in a random $d$ regular graph in $O(\log n)$ steps and the initial majority opinion wins. We also show the same performance for any regular graph, if $\nu_0 \geq K \lambda_2$ where $\lambda_2$ is the second largest eigenvalue of the transition matrix. In the graphs we consider, standard pull voting requires $\Omega(n)$ steps, and the minority can still win with probability $|B|/n$.Comment: 22 page